Heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization
نویسندگان
چکیده
منابع مشابه
Makespan Minimization with Machine Availability Constraints
We investigate the problems of scheduling n jobs tom = m1+ m2 identical machines where m1 machines are always available, m2 machines have some specified unavailable intervals.The objective is tominimize the makespan. We assume that if a job is interrupted by the unavailable interval, it can be resumed after the machine becomes available. We show that if at least one machine is always available,...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملHeuristic algorithms for two-machine flowshop with availability constraints
The majority of the scheduling studies carry a common assumption that machines are available all the time. However, machines may not always be available in the scheduling period due to breakdown or preventive maintenance. Taking preventive maintenance activity into consideration, we dealt with the twomachine flowshop scheduling problem with makespan objective. The preventive maintenance policy ...
متن کاملHeuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
This Article is brought to you for free and open access by the Engineering Management & Systems Engineering at ODU Digital Commons. It has been accepted for inclusion in Engineering Management & Systems Engineering Faculty Publications by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. Repository Citation Salem, Mohammed Al; Bedoy...
متن کاملMakespan Minimization on Three-Machine Flow shop with deteriorating jobs
In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job’s processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.08.466